postfix notation - ορισμός. Τι είναι το postfix notation
Diclib.com
Λεξικό ChatGPT
Εισάγετε μια λέξη ή φράση σε οποιαδήποτε γλώσσα 👆
Γλώσσα:

Μετάφραση και ανάλυση λέξεων από την τεχνητή νοημοσύνη ChatGPT

Σε αυτήν τη σελίδα μπορείτε να λάβετε μια λεπτομερή ανάλυση μιας λέξης ή μιας φράσης, η οποία δημιουργήθηκε χρησιμοποιώντας το ChatGPT, την καλύτερη τεχνολογία τεχνητής νοημοσύνης μέχρι σήμερα:

  • πώς χρησιμοποιείται η λέξη
  • συχνότητα χρήσης
  • χρησιμοποιείται πιο συχνά στον προφορικό ή γραπτό λόγο
  • επιλογές μετάφρασης λέξεων
  • παραδείγματα χρήσης (πολλές φράσεις με μετάφραση)
  • ετυμολογία

Τι (ποιος) είναι postfix notation - ορισμός

MATHEMATICAL NOTATION IN WHICH EVERY OPERATOR FOLLOWS ALL OF ITS OPERANDS
Reverse polish notation; Postfix notation; Reverse Polish Notation; RPN calculator; Post fix notation; Reverse Polish; Postfix form; Reverse-Polish notation; Reverse-Polish; Notation Polish reverse; Entry RPN; Classical RPN; Three-level RPN; Four-level RPN; 3-level RPN; 4-level RPN; Umgekehrte Polnische Notation; RPN (notation); UPN (notation); 5-level RPN; Five-level RPN; 128-level RPN; 8-level RPN; Eight-level RPN; Advanced RPN; Advanced Reverse Polish Notation; ONP (notation); Odwrotna notacja polska; Postfix operator; Two-level RPN; 2-level RPN; Automatic Memory Stack; Automatic memory stack; Operational stack; Operational memory stack; Operational Memory Stack; Operational Stack; Postfix expression; Reversed-Polish form; Reversed-Polish notation; Postfixed notation; Reversed Polish; Reverse Łukasiewicz notation; Reverse Lukasiewicz notation; Reverse Polish string; Reverse Polish notation string; Reverse Polish string notation; RPN automatic stack; Automatic stack lift; Automatic stack lifting; RPN stack lift; RPN stack lifting; RPN automatic stack lift; RPN automatic stack lifting; Stack lift disable; RPN stack lift disable; Automatic stack operation; RPN automatic stack operation; RPN ASL; Automatic Enter; Automatic ENTER; HP stack lift disable; HP automatic stack operation; HP automatic stack; HP stack lift; HP stack lifting; HP automatic stack lift; HP automatic stack lifting; HP automatic Enter; HP automatic ENTER; Reverse notation (calculators); RPN convention; HP RPN; Hewlett-Packard RPN; HP RPN system; RPN system
  • A promotional Hewlett-Packard "No Equals" hat from the 1980s – both a boast and a reference to RPN
  • 125px

postfix notation         
<language> (Or "Reverse Polish Notation", RPN) One of the possible orderings of functions and operands: in postfix notation the functions are preceded by all their operands. For example, what may normally be written as "1+2" becomes "1 2 +". Postfix notation is well suited for stack based architectures but modern compilers reduced this advantage considerably. The best-known language with postfix syntax is FORTH. Some Hewlett-Packard calculators use it, e.g. HP-25, HP-29C, HP-41C, HP-23SII. Compare: infix notation, prefix notation. (2003-06-23)
Reverse Polish Notation         
Reverse Polish notation         
Reverse Polish notation (RPN), also known as reverse Łukasiewicz notation, Polish postfix notation or simply postfix notation, is a mathematical notation in which operators follow their operands, in contrast to Polish notation (PN), in which operators precede their operands. It does not need any parentheses as long as each operator has a fixed number of operands.

Βικιπαίδεια

Reverse Polish notation

Reverse Polish notation (RPN), also known as reverse Łukasiewicz notation, Polish postfix notation or simply postfix notation, is a mathematical notation in which operators follow their operands, in contrast to Polish notation (PN), in which operators precede their operands. It does not need any parentheses as long as each operator has a fixed number of operands. The description "Polish" refers to the nationality of logician Jan Łukasiewicz, who invented Polish notation in 1924.

The first computer to use postfix notation, though it long remained essentially unknown outside of Germany, was Konrad Zuse's Z3 in 1941 as well as his Z4 in 1945. The reverse Polish scheme was again proposed in 1954 by Arthur Burks, Don Warren, and Jesse Wright and was independently reinvented by Friedrich L. Bauer and Edsger W. Dijkstra in the early 1960s to reduce computer memory access and use the stack to evaluate expressions. The algorithms and notation for this scheme were extended by the Australian philosopher and computer scientist Charles L. Hamblin in the mid-1950s.

During the 1970s and 1980s, Hewlett-Packard used RPN in all of their desktop and hand-held calculators, and has continued to use it in some models into the 2020s. In computer science, reverse Polish notation is used in stack-oriented programming languages such as Forth, STOIC, PostScript, RPL, and Joy.